POWER SERIES RINGS OVER PRÜFER v-MULTIPLICATION DOMAINS
نویسندگان
چکیده
منابع مشابه
A "υ-Operation Free" Approach to Prüfer υ-Multiplication Domains
The so-called Prüfer υ-multiplication domains PυMDs are usually defined as domains whose finitely generated nonzero ideals are t-invertible. These domains generalize Prüfer domains and Krull domains. The PυMDs are relatively obscure compared to their verywell-known special cases. One of the reasons could be that the study of PυMDs uses the jargon of star operations, such as the υ-operation and ...
متن کاملPower Series over Generalized Krull Domains
We resolve an open problem in commutative algebra and Field Arithmetic, posed by Jarden – Let R be a generalized Krull domain. Is the ring R[[X]] of formal power series over R a generalized Krull domain? We show that the answer is negative.
متن کاملCurves and coherent Prüfer rings
Usual definitions of Dedekind domain are not well suited for an algorithmic treatment. Indeed, the notion of Noetherian rings is subtle from a constructive point of view, and to be able to get prime ideals involve strong hypotheses. For instance, if k is a field, even given explicitely, there is in general no method to factorize polynomials in k[X]. The work [2] analyses the notion of Dedekind ...
متن کاملAutomorphisms of Formal Power Series Rings over a Valuation Ring
The aim of this paper is to report on recent work on liftings of groups of au-tomorphisms of a formal power series ring over a eld k of characteristic p to characteristic 0, where they are realised as groups of automorphisms of a formal power series ring over a suitable valuation ring R dominating the Witt vectors W(k): We show that the lifting requirement for a group of automorphisms places se...
متن کاملFast Multiplication of Polynomials over Arbitrary Rings*
An algorithm is presented that allows to multiply two univariate polynomials of degree no more than n with coefficients from an arbitrary (possibly non-commutative) ring in O(n log(n) log(log n)) additions and subtractions and O(n log(n)) multiplications. The arithmetic depth of the algorithm is O(log(n)). This algorithm is a modification of the Schönhage-Strassen procedure to arbitrary radix f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2016
ISSN: 0304-9914
DOI: 10.4134/jkms.2016.53.2.447